/**
 * https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted
 * @param {number[]} numbers
 * @param {number} target
 * @return {number[]}
 */
 var twoSum = function(numbers, target) {
    let l = 0;
    let r = numbers.length - 1;
    while (l < r) {
        if (numbers[l] + numbers[r] === target) {
            return [l + 1, r + 1];
        }
        numbers[l] + numbers[r] > target ? r-- : l++;
    }
    return [];
};